Common Association Rules for Dispersed Information Systems

Association rules are popular form for knowledge discovery domain. They used finding interesting relationships and patterns hidden in large data sets the area of associative classification, where usually with one item right-hand side considered. There many different approaches algorithms mining association rules. One most group methods which based on frequent itemsets, applied transaction format. Such can be transformed to binary information system corresponds matrix Technological development means that we dealing an increasing amount heterogeneous, taking into account their format location. In this paper, assume dispersed is represented by a finite set S systems equal attributes. We discuss possible ways study common all from S: building joint true realizable given row r have attribute f coincides S, r, side. show how build polynomial time. When such system, apply it various rule learning algorithms.